Tight Bounds on the Complexity of Cascaded Decomposition of Automata
نویسندگان
چکیده
In this paper we give exponential upper and lower bounds on the size of the cascaded (Krohn-Rhodes) decomposition of automata. These results are used for giving elementary algorithms for various translations between automata and temporal logic, where the previously-known translations were nonelementary.
منابع مشابه
On the Cascaded Decomposition of Automata its Complexity and its Application to Logic Draft
The primary decomposition theorem due to Krohn and Rhodes KR which has been considered as one of the fundamental results in the theory of automata and semigroups states that every automaton is homomorphic to a cascaded de composition wreath product of simpler automata of two kinds reset automata and permutation automata If the automaton is non counting and correspond ingly its transformation se...
متن کاملThe Size of One-Way Cellular Automata
We investigate the descriptional complexity of basic operations on real-time one-way cellular automata with an unbounded as well well as a fixed number of cells. The size of the automata is measured by their number of states. Most of the bounds shown are tight in the order of magnitude, that is, the sizes resulting from the effective constructions given are optimal with respect to worst case co...
متن کاملTight Bounds using Hankel Matrix for Arithmetic Circuits with Unique Parse Trees
This paper studies lower bounds for arithmetic circuits computing (non-commutative) polynomials. Our conceptual contribution is an exact correspondence between circuits and weighted automata: algebraic branching programs are captured by weighted automata over words, and circuits with unique parse trees by weighted automata over trees. The key notion for understanding the minimisation question o...
متن کاملState Complexity of Union and Intersection of Finite Languages
We investigate the state complexity of union and intersection for finite languages. Note that the problem of obtaining the tight bounds for both operations was open. First we compute upper bounds using structural properties of minimal deterministic finite-state automata for finite languages. Then, we show that the upper bounds are tight if we have a variable sized alphabet that can depend on th...
متن کاملReduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کامل